An expected polynomial time algorithm for coloring 2-colorable 3-graphs
نویسندگان
چکیده
We present an algorithm that colors a random 2-colorable 3-uniform hypergraph optimally in expected running time O(n5 log n).
منابع مشابه
Randomized Online Graph Coloring (Preliminary Version)
In this paper we study the problem of coloring graphs in an online manner. The only known deterministic online graph coloring algorithm with a sublinear performance function was found by Lov&z, Saks and Trotter [5]. Their algorithm colors graphs of c h r s matic number x with no more than ((2xn)/log*n) colors, where n is the number of vertices. They point out that the performance can be improve...
متن کاملA simple algorithm for 4-coloring 3-colorable planar graphs
Graph coloring for 3-colorable graphs receives very much attention by many researchers in theoretical computer science. Deciding 3-colorability of a graph is a well-known NP-complete problem. So far, the best known polynomial approximation algorithm achieves a factor of O(n0.2072), and there is a strong evidence that there would be no polynomial time algorithm to color 3-colorable graphs using ...
متن کاملColoring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that either solve the problem in most but not all cases, but are of polynomial time complexity, or that give a correct solution on all input graphs while guaranteeing a polynomial running time on average only. An algorithm of the first ki...
متن کاملFinding Large Independent Sets
This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...
متن کاملColoring k-colorable graphs using relatively small palettes
We obtain the following new coloring results: A 3-colorable graph on n vertices with maximum degree can be colored, in polynomial time, using O(( log ) 1=3 logn) colors. This slightly improves an O(( 1=3 log ) logn) bound given by Karger, Motwani and Sudan. More generally, k-colorable graphs with maximum degree can be colored, in polynomial time, using O(( 1 2=k log ) logn) colors. A 4-colorabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 34 شماره
صفحات -
تاریخ انتشار 2009